Bisimulation for Higher-Order Process Calculi
نویسنده
چکیده
A higher-order process calculus is a calculus for communicating systems which contains higher-order constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard deenition of bisimulation (i.e., the one for CCS and related calculi), as well as higher-order bisimulation AGR88, Bou89, Tho90] are in general unsatisfactory, because over-discriminating. We propose and study a new form of bisimulation for such calculi, called context bisim-ulation, which yields a more satisfactory discriminanting power. A drawback of context bisimulation is the heavy use of universal quantiication in its deenition. A major goal of the paper is to nd characterisations which make bisimilarities easier to verify. An important role in our theory is played by the factorisation theorem: When comparing the behaviour of two processes, it allows us to \isolate" subcomponents which might cause diierences, so that the analysis can be concentrated on them. Bisimulation pour les calculs de processus d'ordre sup erieur R esum e : Un calcul de processus d'ordre sup erieur est un calcul pour des syst emes de communication qui contient des op erateurs d'ordre sup erieur comme communications des termes. Nous analysons la notion de bisimulation pour ces calculs. Nous retenons que la d eenition standard de bisimulation (c-ad , celle pour CCS et les calculs s'y rapportant), ainsi que celle de higher-order bisimulation AGR88, Bou89, Tho90] sont en general non satisfaisantes, car trop discriminantes. Nous proposons et etudions une nouvelle forme de bisimulation pour de tels calculs, appel ee context bisimulation, qui oore un pouvoir de discrimination plus satisfaisant. Un inconv enient a la context bisimulation est l'utilisation massive de quantiication universelle dans sa d eenition. L'object principal de cet article est de trouver des caract erisations qui facilitent la v eriication des bisimulations. Le th eor eme de factorisation joue un r^ ole important dans notre th eorie. Lorsque l'on compare le comportement de deux processus, il permet d' \isoler" des sous-compossants qui peuvent provoquer des dii erences; l'analyse peut donc se concentrer sur eux. Mots-cl e : Bisimulation, calculs de processus d'ordre sup erieur Bisimulation for higher-order process calculi 3 1 Introduction
منابع مشابه
Congruence Proofs for Weak BisimulationEquivalences on Higher { order ProcessCalculiMichael
Congruence proofs for bisimulation equivalences on higher{order process calculi tend to be signiicantly more complex than their counterparts in rst{order process algebra frameworks. The fact that higher{order synchronization invokes substitution seems to be the main problem. The reason is that it renders standard rst{order proof techniques circular in the higher{order case, and this situation i...
متن کاملTechnische Universität Berlin Forschungsberichte des Fachbereichs Informatik
Congruence proofs for bisimulation on higher{order process calculi tend to be signiicantly more complex than their counterparts in rst{order process algebra frameworks. Moreover, a standard technique that allows us to cover strong forms of bisimulation on higher{order calculi seems to fail for the corresponding weak forms. Similar problems are posed by applicative simulation on {calculi and our...
متن کاملOn Bisimulation Theory in Linear Higher-Order π-Calculus
Higher-order process calculi have been receiving much attention in recent years for its significance in both theorey and practice. Work on bisimulations has never ceased evolving, typically represented by Thomsen and Sangiorgi for their work on bisimulation theory and encoding to and from first-order process calculi. Fu puts forth linear higher-order π-calculus, and makes improvement to previou...
متن کاملNormal Bisimulations in Calculi with Passivation
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterizations of barbed congruence, such as the notion of normal bisimulation developed by Sangiorgi for the higherorder π-calculus, are difficult to obtain. In this paper, we study bisimulations in two simple higher-order calculi w...
متن کاملBisimulation Congruences for Homer a calculus of Higher-order mobile embedded resources
We extend Howe’s method for proving that late labelled transition bisimulations are congruences to a core process passing calculus with local names, extended with non-linear active process mobility and nested locations, as found in the Seal calculus, M-calculus, and Kell-calculus. The calculus we consider, called Homer for Higher-order Mobile Embedded Resources, has a very simple syntax and sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 131 شماره
صفحات -
تاریخ انتشار 1996